Combinatorial acyclicity models for potential‐based flows

Combinatorial Continuous Maximal Flows

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of maxflow defined on a graph...

Acyclicity versus Total Acyclicity for Complexes over Noetherian Rings

It is proved that for a commutative noetherian ring with dualizing complex the homotopy category of projective modules is equivalent, as a triangulated category, to the homotopy category of injective modules. Restricted to compact objects, this statement is a reinterpretation of Grothendieck’s duality theorem. Using this equivalence it is proved that the (Verdier) quotient of the category of ac...

Network Flows and Combinatorial Optimization

Combinatorial Ricci Flows on Surfaces

We show that the analogue of Hamilton’s Ricci flow in the combinatorial setting produces solutions which converge exponentially fast to Thurston’s circle packing on surfaces. As a consequence, a new proof of Thurston’s existence of circle packing theorem is obtained. As another consequence, Ricci flow suggests a new algorithm to find circle packings.

Combinatorial Flows and Their Normalisation

This paper introduces combinatorial flows that generalize combinatorial proofs such that they also include cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic proofs are translated into combinatorial flows and vice versa. 1998 ACM Subject Classification F.4.1 [Mathematical Logic] Proof Theory